Constructions and Noise Threshold of Hyperbolic Surface Codes
نویسندگان
چکیده
منابع مشابه
Threshold Error Rates for the Toric and Surface Codes
The surface code scheme for quantum computation features a 2d array of nearestneighbor coupled qubits yet claims a threshold error rate approaching 1% [1]. This result was obtained for the toric code, from which the surface code is derived, and surpasses all other known codes restricted to 2d nearest-neighbor architectures by several orders of magnitude. We describe in detail an error correctio...
متن کاملSeparating Codes: Constructions and Bounds
Separating codes, initially introduced to test automaton, have revived lately in the study of fingerprinting codes, which are used for copyright protection. Separating codes play their role in making the fingerprinting scheme secure agains coalitions of pirates. We provide here better bounds, constructions and generalizations for these codes.
متن کاملConstructions for identifying codes
A nonempty set of words in a binary Hamming space F is called an r-identifying code if for every word the set of codewords within distance r from it is unique and nonempty. The smallest possible cardinality of an r-identifying code is denoted by Mr(n). In this paper, we consider questions closely related to the open problem whether Mt+r(n + m) ≤ Mt(m)Mr(n) is true. For example, we show results ...
متن کاملConstructions of MDS-convolutional codes
Maximum-distance separable (MDS) convolutional codes are characterized through the property that the free distance attains the generalized singleton bound. The existence of MDS convolutional codes was established by two of the authors by using methods from algebraic geometry. This correspondence provides an elementary construction of MDS convolutional codes for each rate k/n and each degree δ. ...
متن کاملNew Constructions of Covering Codes
Covering code constructions obtaining new codes from starting ones were developed during last years. In this work we propose new constructions of such kind. New linear and nonlinear covering codes and an infinite families of those are obtained with the help of constructions proposed. A table of new upper bounds on the length function is given.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2016
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2016.2555700